منابع مشابه
A Graph-Coloring Result and Its Consequences For Polygon-Guarding Problems
We prove the following graph coloring result Let G be a connected bipartite planar graph Then one can triangulate G in such a way that the resulting graph is colorable This result implies several new upper bounds for guarding problems including the rst non trivial upper bound for the rectilinear Prison Yard Problem n vertex guards are su cient to watch the interior of a rectilinear polygon with...
متن کاملGuarding Art Galleries by Guarding Witnesses
Let P be a simple polygon. We define a witness set W to be a set of points such that if any (prospective) guard set G guards W , then it is guaranteed that G guards P . We show that not all polygons admit a finite witness set. If a finite minimal witness set exists, then it cannot contain any witness in the interior of P ; all witnesses must lie on the boundary of P , and there can be at most o...
متن کاملPolygon Clipping and Polygon Reconstruction
Polygon clipping is an important operation that computers execute all the time. An algorithm that clips a polygon is rather complex. Each edge of the polygon must be tested against each edge of the clipping window, usually a rectangle. As a result, new edges may be added, and existing edges may be discarded, retained, or divided. Multiple polygons may result from clipping a single polygon. Afte...
متن کاملTriangle Guarding
We consider the problem of triangle guarding (4-guarding) a simple, 2D polygon Q. A polygon Q is 4-guarded if every point q of Q is contained in the convex hull of some three guards that can all see q. This rather odd condition approximates a desire, for example, to see all sides of q or to locate (via triangulation) q from at least two angularly well-separated views. If we restrict the guards ...
متن کاملGuarding orthogonal art galleries with sliding cameras
Let P be an orthogonal polygon with n vertices. A sliding camera travels back and forth along an orthogonal line segment s ⊆ P corresponding to its trajectory. The camera sees a point p ∈ P if there is a point q ∈ s such that pq is a line segment normal to s that is completely contained in P . In the MinimumCardinality Sliding Cameras (MCSC) problem, the objective is to find a set S of sliding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2016
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2016.07.004